# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600498 | UncoolAnon | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 340 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>
#define ll long long
using namespace std;
ll find_maximum(int k,vector<vector<int>> a){
ll answer=0;
int n=a.size(),m=a[0].size();
vector<int> kek ;
for(int i=0;i<n;++i)
for(int j=0;j<m;j++)
kek.push_back(a[i][j]);
auto vanswer=a;
for(auto&x:vanswer)
for(int&y:x)
y=0;
sort(kek.begin(),kek.end());
for(int i=0;i<kek.size();i++)
answer+=kek[i]*(kek.size()/2>i?-1:1);
return answer;
}
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... |