제출 #1039644

#제출 시각아이디문제언어결과실행 시간메모리
1039644amirhoseinfar1385카니발 티켓 (IOI20_tickets)C++17
11 / 100
3 ms6748 KiB
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1500+10;
int n,m,all[maxn][maxn];
vector<vector<int>>res;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size();
	m = x[0].size();
	res.resize(n,vector<int>(m));
	vector<long long>suma;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			all[i][j]=x[i][j];
			res[i][j]=0;
			suma.push_back(all[i][j]);
		}
	}
	sort(suma.begin(),suma.end());
	long long mainres=0;
	for(int i=0;i<n;i++){
	//	cout<<i<<" "<<n/2<<" "<<suma[i]<<endl;
		if(i<n/2){
			mainres-=suma[i];
		}else{
			mainres+=suma[i];
		}
	}
	allocate_tickets(res);
	return mainres;
}
#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...