이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
/*void allocate_tickets(vector<vector<int>> s){
for(int i=0;i<s.size();i++){
for(int j=0;j<s[0].size();j++){
cout<<s[i][j]<<" ";
}
cout<<endl;
}
}
*/
long long find_maximum(int k,vector<vector<int>> x){
vector<vector<int>> allocate;
int Total=x.size();
vector<int> push={0};
for(int i=0;i<Total;i++){
allocate.push_back(push);
}
allocate_tickets(allocate);
long long int answer=0;
int List[x.size()];
for(int i=0;i<Total;i++){
List[i]=x[i][0];
}
sort(List,List+Total);
int Middle=Total/2;
for(int i=0;i<Total;i++){
answer+=abs(List[Middle]-List[i]);
}
return answer;
}
# | 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... |