제출 #303641

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303641		medmdg	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	47 ms	9216 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long int fin(vector<vector<int> > a,int n,int m,int k){
    for(int i=0;i<n;i++){
        sort(a[i].begin(),a[i].end());
    }
     long long int ans=0;
    for(int i=0;i<n;i++){
        double mid=0;
        for(int j=0;j<m;j++){
            mid+=a[i][j];
        }
        mid/=m;
        long long int ff=a[i][(m+1)/2];
        for(int j=0;j<m;j++){
            ans+=(long long int)(abs(ff-a[i][j]));
        }
    }
    return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
    /*int n=x.size();
    int m=x[0].size();
    if(m==1){
        vector<vector<int> > ans(n);
        vector<vector<int> > answ(k);
        for(int i=0;i<n;i++){
            ans[i].push_back(0);
            answ[0].push_back(x[i][0]);
        }
            allocate_tickets(ans);
            return fin(answ,k,n,k);
    }
    if(k==1){
        vector<int> 
    }*/
    int a[1500*1500];
    sort(a,a+1500*1500);
    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10