Submission #492857

# Submission time Handle Problem Language Result Execution time Memory
492857 2021-12-09T10:55:20 Z watoKE Art Exhibition (JOI18_art) C++17
0 / 100
1 ms 204 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

int n,m,a,b,c,cnt,g,f,d,e,cvp,k;
pair<int,int> dizi[100005];
int fark[100005];
string s;

int main()
{
    cin>>n;
    for (int i=0;i<n;i++)
        cin>>dizi[i].first>>dizi[i].second;
    sort(dizi,dizi+n);
    int mx=0;
    for (int i=0;i<n-1;i++)
    {
        int cvp=dizi[i].second;
        for (int j=i+1;j<n;j++)
        {
            cvp+=dizi[j].second;
            mx=max(mx,cvp-dizi[j].first+dizi[i].first);
        }
    }
    cout<<mx;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -