oj.uz

답안 #725521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725521 2023-04-17T14:49:33 Z vjudge1 학교 설립 (IZhO13_school) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define F first
#define S second

using namespace std;

using ll = long long;
using PI = pair<ll, ll>;
using PII = pair<PI, ll>;

int main()
{
    freopen("school.in", "r", stdin);
    freopen("school.out", "w", stdout);

    //ios_base::sync_with_stdio(0); cin.tie(0);

    cout << "A";
    return 0;
    
    ll n, m, s; cin >> n >> m >> s;

    vector<PII> vp(n+10);
    for(ll i = 0; i < n; i++){
        cin >> vp[i].F.F >> vp[i].F.S;
        vp[i].S = i;
    }

    vector<PII> ord;
    for(ll i = 0; i < n; i++){
        ord.push_back({{vp[i].F.F-vp[i].F.S, vp[i].F.F}, i});
    }

    sort(ord.begin(), ord.end(), [&](PII a, PII b){
        if(a.F.F != b.F.F){
            return a.F.F > b.F.F;
        }
        return a.F.S > b.F.S;
    });

    ll ans = 0;
    ll indx = 0;
    vector<bool> vis(n+10);

    while(m--){
        ans += vp[ord[indx].S].F.F;
        vis[ord[indx].S] = true;
        indx++;
    }

    sort(vp.begin(), vp.end(), [&](PII a, PII b){
        if(a.F.S != b.F.S){
            return a.F.S > b.F.S;
        }
        return a.F.F > b.F.F;
    });

    ll cnt = 0;
    ll i = 0;
    while(cnt != s && i != n-1){
        if(!vis[vp[i].S]){
            ans += vp[i].F.S;
            cnt++;
        }
        i++;
    }
    cout << ans <<"\n";

}

Compilation message

school.cpp: In function 'int main()':
school.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen("school.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
school.cpp:14:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen("school.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Incorrect 0 ms 212 KB Output isn't correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Incorrect 0 ms 212 KB Output isn't correct
19 Incorrect 0 ms 212 KB Output isn't correct
20 Incorrect 0 ms 212 KB Output isn't correct