Sunbelt Computer Software

PL/B Language Development and Support

algorithm/cf/132/C.cpp at master · aukw/algorithm · GitHub

35 lines (22 loc) · 428 Bytes

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int MAXN = 5001;
int ts[MAXN], Ts[MAXN], xs[MAXN], costs[MAXN];
void work(){
    long long int ans = 0;
    for(int i=0; i<n; i++){
int main(){
    cin>>n>>m;
    for(int i=0; i<n; i++){
        cin>>ts[i]>>Ts[i]>>xs[i]>>costs[i];
    work();
    return 0;