Submission #18052

#TimeUsernameProblemLanguageResultExecution timeMemory
18052chan492811컬러볼 (KOI15_ball)C++98
0 / 25
115 ms4988 KiB
#include <cstdio>
#include <algorithm>
using namespace std;
int n,sum;
struct data{
    int z,x,idx;
};
data arr[200010];
int index[200010],color[200010];
bool compare(data d1,data d2){
    return d1.x<d2.x;
}
int main(){
    int i;
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d %d",&arr[i].z,&arr[i].x),arr[i].idx=i;
    sort(arr,arr+n,compare);
    for(i=0;i<n;i++){
        index[arr[i].idx]=sum-color[arr[i].z];
        sum+=arr[i].x; color[arr[i].z]+=arr[i].x;
    }
    for(i=0;i<n;i++) printf("%d\n",index[i]);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...