# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228345 | kimbj0709 | Cloud Computing (CEOI18_clo) | C++14 | 987 ms | 2424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,pair<int,pair<int,int> > >
#define f first
#define s second
#define LLONG_MIN -10000000000000000
#define maxn 100050
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int no_of_input;
int input1,input2,input3,input4;
vector<pii> vect1;
cin >> no_of_input;
for(int i=0;i<no_of_input;i++){
cin >> input1 >> input2 >> input3;
vect1.push_back({input2,{1,{input1,input3}}});//frequency,sub,corecount,price
}
cin >> no_of_input;
for(int i=0;i<no_of_input;i++){
cin >> input1 >> input2 >> input3;
vect1.push_back({input2,{-1,{input1,input3}}});//frequency,sub,corecount,price
}
sort(vect1.begin(),vect1.end());
reverse(vect1.begin(),vect1.end());
vector<int> dp(maxn,LLONG_MIN);
dp[0] = 0;
vector<int> temp(maxn,LLONG_MIN);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |