# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936325 | DobromirAngelov | Art Exhibition (JOI18_art) | C++14 | 148 ms | 26804 KiB |
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>
#define endl '\n'
#define fi first
#define se second
using namespace std;
const int MAXN=5e5+5;
int n;
pair<long long,int> a[MAXN];
long long d[MAXN];
int suffMax[MAXN];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i].fi>>a[i].se;
sort(a+1,a+n+1);
for(int i=1;i<=n;i++) d[i]=d[i-1]+a[i].se;
for(int i=1;i<=n;i++) d[i]-=a[i].fi;
suffMax[n]=n;
for(int i=n-1;i>=1;i--)
# | 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... |