oj.uz

답안 #89119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89119 2018-12-10T10:46:26 Z Lkvatashidze 학교 설립 (IZhO13_school) C++17
5 / 100
 127 ms 9468 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

  struct ABC {
    int fir, sec, ind;
 };

   bool comp (ABC a, ABC b) {
      return a.fir>b.fir;
   }

   ABC v[300005];
   pair < int, int > se[300005], fi[300005];
   bool used[300005];

 int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

     ll n, m, s;
      cin >> n >> m >> s;

    for (int k=1; k<=n; k++) {
        cin >> v[k].fir;
        cin >> v[k].sec;
        fi[k].first=v[k].fir;
        fi[k].second=k;
        se[k].first=v[k].sec;
        se[k].second=k;
        v[k].ind=k;
    }

    sort(v+1,v+1+n, comp);

        int k=1; ll ans=0;

  while (k<n && s && m) {
        ans+=max(v[k].sec+v[k+1].fir,v[k].fir+v[k+1].sec);
        used[v[k].ind]=true;
        used[v[k+1].ind]=true;
        m--;
        s--;
        k+=2;
    }


     if (m==0) {
      sort(se+1,se+1+n);
      reverse(se+1,se+1+n);
      for (int i=1; i<=n; i++) {
            if (s==0) break;
        if (used[se[i].second]) continue;
        ans+=se[i].first;
        s--;
      }
       cout << ans;
       return 0;
  }
     if (s==0) {
      sort(fi+1,fi+1+n);
      reverse(fi+1,fi+1+n);
      for (int i=1; i<=n; i++) {
            if (m==0) break;
        if (used[fi[i].second]) continue;
        ans+=fi[i].first;
        m--;
      }
       cout << ans;
       return 0;
 }
    return 0;
}

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Correct 2 ms 504 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct
4 Incorrect 2 ms 636 KB Output isn't correct
5 Incorrect 2 ms 636 KB Output isn't correct
6 Incorrect 2 ms 636 KB Output isn't correct
7 Incorrect 4 ms 732 KB Output isn't correct
8 Incorrect 4 ms 752 KB Output isn't correct
9 Incorrect 4 ms 800 KB Output isn't correct
10 Incorrect 4 ms 1108 KB Output isn't correct
11 Incorrect 4 ms 1108 KB Output isn't correct
12 Incorrect 4 ms 1108 KB Output isn't correct
13 Incorrect 17 ms 1972 KB Output isn't correct
14 Incorrect 37 ms 3196 KB Output isn't correct
15 Incorrect 72 ms 5500 KB Output isn't correct
16 Incorrect 82 ms 6140 KB Output isn't correct
17 Incorrect 93 ms 7168 KB Output isn't correct
18 Incorrect 108 ms 7848 KB Output isn't correct
19 Incorrect 114 ms 8292 KB Output isn't correct
20 Incorrect 127 ms 9468 KB Output isn't correct