This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
pair <ll, ll> a[n];
for (int i = 0; i < n; i++) cin >> a[i].S >> a[i].F;
sort(a, a + n);
ll sum = 0, mx = 0;
for (int i = 0; i < n; i++) swap(a[i].F, a[i].S);
set <pair <ll, int> > se, ser; se.clear(); ser.clear();
for (int i = 0; i < k; i++) {sum += a[i].F; mx = max(mx, a[i].S); se.insert({a[i].F, i}); ser.insert({a[i].S, i});}
for (int i = k; i < n; i++)
{
pair <ll, int> nm = *se.rbegin();
se.erase(nm);
ser.erase({a[nm.S].S, nm.S});
ll len = sum + a[i].F - a[nm.S].F;
ll hg = a[i].S;
if (sz(ser) != 0) hg = max(hg, (*ser.rbegin()).F);
if (sum * mx >= hg * len) {sum = len; mx = hg; se.insert({a[i].F, i}); ser.insert({a[i].S, i}); continue;} else {se.insert(nm); ser.insert({a[nm.S].S, nm.S});}
nm = *ser.rbegin();
ser.erase(nm);
se.erase({a[nm.S].F, nm.S});
len = sum + a[i].F - a[nm.S].F;
hg = a[i].S;
if (sz(ser) != 0) hg = max(hg, (*ser.rbegin()).F);
if (sum * mx >= hg * len) {sum = len; mx = hg; se.insert({a[i].F, i}); ser.insert({a[i].S, i});} else {ser.insert(nm); se.insert({a[nm.S].F, nm.S});}
}
cout << sum * mx << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |