oj.uz

답안 #89122

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

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

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

   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;
        v[k].sum=v[k].fir+v[k].sec;
    }

    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
15.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Incorrect 2 ms 580 KB Output isn't correct
5 Incorrect 2 ms 580 KB Output isn't correct
6 Incorrect 3 ms 632 KB Output isn't correct
7 Incorrect 4 ms 668 KB Output isn't correct
8 Incorrect 4 ms 688 KB Output isn't correct
9 Incorrect 4 ms 688 KB Output isn't correct
10 Incorrect 4 ms 688 KB Output isn't correct
11 Incorrect 4 ms 796 KB Output isn't correct
12 Incorrect 4 ms 796 KB Output isn't correct
13 Incorrect 17 ms 1704 KB Output isn't correct
14 Incorrect 36 ms 3152 KB Output isn't correct
15 Incorrect 75 ms 5736 KB Output isn't correct
16 Incorrect 83 ms 6324 KB Output isn't correct
17 Incorrect 97 ms 7648 KB Output isn't correct
18 Incorrect 103 ms 8288 KB Output isn't correct
19 Incorrect 115 ms 8936 KB Output isn't correct
20 Incorrect 137 ms 10248 KB Output isn't correct