Submission #147367

#TimeUsernameProblemLanguageResultExecution timeMemory
147367alexandra_udristoiuHokej (COCI17_hokej)C++14
0 / 120
557 ms22904 KiB
#include<iostream> #include<algorithm> #define DIM 500005 using namespace std; int m, n, i, j, nr, ii, jj, u; long long sol; int a[7][DIM]; struct str{ int val, t, ind; }; str v[DIM]; int cmp(str a, str b){ return a.val > b.val; } int main(){ cin>> m >> n; for(i = 1; i <= n; i++){ cin>> v[i].val >> v[i].t; v[i].ind = i; } sort(v + 1, v + n + 1, cmp); ii = jj = u = 1; for(i = 1; i <= m * 6; i++){ if(v[u].t == 0){ u++; } sol += v[u].val; v[u].t--; a[ii][jj] = v[u].ind; jj++; if(jj == m + 1){ jj = 1; ii++; } } cout<< sol <<"\n"; for(i = 1; i <= 6; i++){ cout<< a[i][1] <<" "; } cout<<"\n"; for(i = 1; i <= 6; i++){ for(j = 2; j <= m; j++){ if(a[i][j] != a[i][j - 1]){ nr++; } } } cout<< nr <<"\n"; for(j = 2; j <= m; j++){ for(i = 1; i <= 6; i++){ if(a[i][j] != a[i][j - 1]){ cout<< j <<" "<< a[i][j - 1] <<" "<< a[i][j] <<"\n"; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...