Submission #1214094

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214094		yogesh_sane	Sails (IOI07_sails)	C++20	100 / 100	55 ms	5192 KiB

sails

#include <iostream>
#include <algorithm>
#include <set>
using namespace std;

#define int long long

pair<int,int> v[100001];
multiset<int> s;
signed main()
{
    int n,i,aux,h,k,rasp=0,cnt=0;
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>v[i].first>>v[i].second;
    }
    sort(v+1,v+n+1);
    s.insert(0);
    for(i=1;i<=n;i++){
        h=v[i].first;
        k=v[i].second;
        s.insert(h);
        auto p = s.upper_bound(h-k);
        auto q=p;
        q=prev(q);
        aux=k+*p+*q-h;
        if(q!=s.begin()) 
            s.erase(q);
        s.insert(aux);
        s.erase(p);
    }
    auto it=s.end();
    while(it!=s.begin()){
        it--;
        rasp += cnt*(*it);
        cnt++;
    }
    cout<<rasp;
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10
• Subtask 11: 10 / 10