# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431178 | A_D | Carnival Tickets (IOI20_tickets) | C++14 | 2 ms | 588 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 "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k,vector<vector<int>>x){
/*
for(auto xx:x){
for(auto y:xx){
cout<<y<<" ";
}
cout<<endl;
}
*/
vector<vector<int>> ans;
vector<int> vec;
for(int i=0;i<x.size();i++){
vec.push_back(0);
ans.push_back(vec);
vec.clear();
}
allocate_tickets(ans);
vec.clear();
for(int i=0;i<x.size();i++){
vec.push_back(x[i][0]);
}
sort(vec.begin(),vec.end());
int sz=vec.size();
long long ann=0;
// for(auto x:vec)cout<<x<<" ";cout<<endl;
for(int i=0;i<sz/2;i++){
ann-=vec[i];
}
for(int i=sz/2;i<sz;i++){
ann+=vec[i];
}
return ann;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |