제출 #1123057

#제출 시각아이디문제언어결과실행 시간메모리
1123057Luvidi카니발 티켓 (IOI20_tickets)C++20
11 / 100
1 ms584 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, std::vector<std::vector<int>> a) { int n = a.size(); int m = a[0].size(); sort(a.begin(),a.end()); long long x=0; for(int i=0;i<n/2;i++)x-=a[i][0]; for(int i=n/2;i<n;i++)x+=a[i][0]; vector<vector<int>> ans(n,vector<int>(m,0)); allocate_tickets(ans); return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...