#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
a = max(a, b);
}
void selfMin(long long& a, long long b){
a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}
template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};
/*
Use DSU dsu(N);
*/
struct DSU {
vector<long long> e;
DSU(long long N) { e = vector<long long>(N, -1); }
// get representive component (uses path compression)
long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool same_set(long long a, long long b) { return get(a) == get(b); }
long long size(long long x) { return -e[get(x)]; }
bool unite(long long x, long long y) { // union by size
x = get(x), y = get(y);
if (x == y) return false;
if (e[x] > e[y]) swap(x, y);
e[x] += e[y]; e[y] = x;
return true;
}
};
/*
Run with Bit<long long> BIT
*/
template <class T> class BIT {
private:
long long size;
vector<T> bit;
vector<T> arr;
public:
BIT(long long size) : size(size), bit(size + 1), arr(size) {}
void set(long long ind, long long val) { add(ind, val - arr[ind]); }
void add(long long ind, long long val) {
arr[ind] += val;
ind++;
for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
}
T pref_sum(long long ind) {
ind++;
T total = 0;
for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
return total;
}
};
/*
Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;
*/
template<class T> struct Seg {
const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
long long n; vector<T> seg;
void init(long long _n) { n = _n; seg.assign(2*n,ID); }
void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
void upd(long long p, T val) {
seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
T query(long long l, long long r) {
T ra = ID, rb = ID;
for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
if (l&1) ra = comb(ra,seg[l++]);
if (r&1) rb = comb(seg[--r],rb);
}
return comb(ra,rb);
}
};
bool cmp(const pair<int, int>& a, const pair<int, int>& b){
return a.first - a.second < b.first - b.second;
}
vector<int> solve(vector<int>& v, int k) {
multiset<int> ms;
vector<int> ans;
ans.push_back(-1e9);
int sum = 0;
for (int i = 0; i < v.size(); i++){
if (i <= k - 1){
ms.insert(v[i]);
sum += v[i];
}
else{
if (v[i] >= *(ms.begin())){
sum -= *(ms.begin());
ms.erase(ms.find(*(ms.begin())));
sum += v[i];
ms.insert(v[i]);
}
}
if(i >= k - 1){
ans.push_back(sum);
}
else{
ans.push_back(-1e9);
}
}
return ans;
}
int main(){
int n, m, s;
cin >> n >> m >> s;
vector<pair<int, int> > v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
sort(v.begin(), v.end(), cmp);
vector<int> music;
vector<int> sport;
for(int i = 0; i < n; i++){
music.push_back(v[i].first);
sport.push_back(v[i].second);
}
if(s == 0){
cout << solve(music, m).back() << "\n";
}
else if(m == 0){
cout << solve(sport, s).back() << "\n";
}
else{
reverse(music.begin(), music.end());
vector<int> ans1 = solve(music, m);
vector<int> ans2 = solve(sport, s);
reverse(ans2.begin(), ans2.end());
int ans = 0;
for(int i = 0; i <= n; i++){
ans = max(ans, ans1[i] + ans2[i]);
}
cout << ans << "\n";
}
}
Compilation message
school.cpp: In function 'std::vector<int> solve(std::vector<int>&, int)':
school.cpp:96:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | for (int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
300 KB |
Output is correct |
| 7 |
Correct |
3 ms |
444 KB |
Output is correct |
| 8 |
Correct |
4 ms |
596 KB |
Output is correct |
| 9 |
Correct |
3 ms |
564 KB |
Output is correct |
| 10 |
Correct |
4 ms |
664 KB |
Output is correct |
| 11 |
Correct |
3 ms |
596 KB |
Output is correct |
| 12 |
Correct |
5 ms |
596 KB |
Output is correct |
| 13 |
Correct |
27 ms |
2996 KB |
Output is correct |
| 14 |
Correct |
46 ms |
4412 KB |
Output is correct |
| 15 |
Correct |
79 ms |
6948 KB |
Output is correct |
| 16 |
Incorrect |
135 ms |
13836 KB |
Output isn't correct |
| 17 |
Incorrect |
167 ms |
13620 KB |
Output isn't correct |
| 18 |
Incorrect |
173 ms |
13540 KB |
Output isn't correct |
| 19 |
Incorrect |
188 ms |
14648 KB |
Output isn't correct |
| 20 |
Incorrect |
215 ms |
17692 KB |
Output isn't correct |
