imported>jereneal20 at 16:44, 14 August 2012

2012-08-14T16:44:25Z

← Older revision		Revision as of 16:44, 14 August 2012
Line 35:		Line 35:
	return 0;		return 0;
	}		}
			----
			[[ACM_ICPC/2012스터디]]

imported>trailblaze at 10:06, 9 August 2012

2012-08-09T10:06:23Z

New page

#include<iostream>
#include<algorithm>
using namespace std;
struct student{
int a;
int b;
int c;
};
student s[120];
int check[120];
int cc(student a, student b){
return a.c > b.c;
}
int main(void){

int n, i, j;
scanf("%d", &n);
for(i = 0; i<n; i++){
scanf("%d %d %d", &s[i].a, &s[i].b, &s[i].c);
}
sort( s, s+i, cc);
int cnt = 0, ans[5];
for(i=0; i<n; i++){
if(cnt == 3)break;
if(check[s[i].a] < 2){
ans[cnt++] = i;
check[s[i].a]++;
}
}
for(i = 0; i<3; i++){
printf("%d %d\n", s[ans[i]].a, s[ans[i]].b);
}

return 0;
}

Koi aio/권영기 - Revision history

imported>jereneal20 at 16:44, 14 August 2012

imported>trailblaze at 10:06, 9 August 2012