제출 #1333614

#제출 시각아이디문제언어결과실행 시간메모리
1333614ensonIMO (EGOI25_imo)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int N, M, K;
    cin >> N >> M >> K;
    int A[N][M];
    for(int i = 0; i < N; i++){
        for(int j = 0; j < M; j++){
            cin >> A[i][j];
        }
    }
    if(N == 2){
        cout << 2;
        return 0;
        int S[2] = {0};
        for(int i = 0; i < M; i++){
            S[0] += A[0][i];
            S[1] += A[1][i];
        }
        int D[M];

        bool f = S[0] >= S[1];
        for(int i = 0; i < M; i++){
            D[i] = f ? (A[0][i] - A[1][i]) : (A[1][i] - A[0][i]);
        }
        sort(D, D+M, greater<int>());
        int a = K*M;
        for(int i = 0; i < M; i++){
            a -= D[i]+K;
            if (a < 0){
                cout << i+1;
                return 0;
            }
        }
        cout << M;
    }
}
#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...