Coders

input/code.cpp: In function 'int main()':
input/code.cpp:31:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(elite.size() > num) {
                      ^
input/code.cpp:51:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = num; i < costSort.size(); ++i) {
                      ^

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
const int N = 1 << 17;
#define Q first
#define S second

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, c;
  cin >> n >> m >> c;
  int num = (m / 2);
  vector<ii> coders;
  for(int i = 0; i < n; ++i) {
    int q, s;
    cin >> q >> s;
    coders.push_back(ii(q, s));
  }
  sort(coders.begin(), coders.end());
  int x = coders.size() - (num + 1);
  //cout << coders.size() << " " << num << " " << x << " " << coders[x].Q << "\n";

  multiset<int> elite;
  ll eliteCost = 0;

  for(int i = coders.size() - 1; i > x; --i) {
    elite.insert(coders[i].S);
  }
  while(elite.size() > num) {
    elite.erase(--elite.end());
  }
  for(int i : elite) {
    eliteCost += i;
  }

  vector<int> costSort;
  for(int i = 0; i <= x; ++i) {
    costSort.push_back(coders[i].S);
  }
  sort(costSort.begin(), costSort.end());

  multiset<int> ok;
  multiset<int> bad;
  ll noobCost = 0;
  for(int i = 0; i < num; ++i) {
    ok.insert(costSort[i]);
    noobCost += costSort[i];
  }
  for(int i = num; i < costSort.size(); ++i) {
    bad.insert(costSort[i]);
  }

  for(int i = x; i >= num; --i) {
    if(ok.find(coders[i].S) != ok.end()) {
      ok.erase(ok.find(coders[i].S));
      noobCost -= coders[i].S;
      noobCost += *bad.begin();
      ok.insert(*bad.begin());
      bad.erase(bad.begin());
    } else {
      bad.erase(bad.find(coders[i].S));
    }
    if(coders[i].S + eliteCost + noobCost <= c) {
      cout << coders[i].Q << "\n";
      return 0;
    }
    eliteCost += coders[i].S;
    elite.insert(coders[i].S);
    eliteCost -= *elite.rbegin();
    elite.erase(--elite.end());
  } 
  cout << "QAQ\n";
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED