제출 #38947

#제출 시각아이디문제언어결과실행 시간메모리
38947grumpy_gordon학교 설립 (IZhO13_school)C++14
0 / 100
0 ms6864 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 100, inf = 1e9 + 100; int a[maxn], b[maxn], n, M, S; pair<int, int> q[maxn]; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> M >> S; for (int i = 0; i < n; i++) cin >> b[i] >> a[i], q[i] = make_pair(a[i] - b[i], i); sort(q, q + n); int ans = 0; for (int i = 0; i < M; i++) ans += b[q[i].second]; for (int i = 0; i < S; i++) ans += a[q[n - i - 1].second]; cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...