P1271
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 2e6+5;
int s[N];
int main()
{
ios;
int x,n;
cin>>x>>n;
for(int i = 0;i<n;i++)
cin>>s[i];
sort(s,s+n);
for(int i = 0;i<n;i++)
cout<<s[i]<<' ';
cout<<"\n";
}
P1177
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 2e6+5;
int s[N];
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++)
cin>>s[i];
sort(s,s+n);
for(int i = 0;i<n;i++)
cout<<s[i]<<' ';
cout<<"\n";
}
P1923
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
int s[N];
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i = 0;i<n;i++)
scanf("%d",&s[i]);
nth_element(s,s+k,s+n);
printf("%d\n",s[k]);
}
P1059
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
int s[N];
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++) cin>>s[i];
sort(s,s+n);
int t = s[0];
int num = n;
for(int i = 1;i<n;i++)
{
if(s[i]!=t)
{
t = s[i];
}
else
num--,s[i] = -1;
}
cout<<num<<"\n";
for(int i = 0;i<n;i++)
if(s[i]>0) cout<<s[i]<<' ';
}
P1093
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
struct student
{
int num;
int a,b,c;
int sum;
void add()
{
sum=a+b+c;
}
}s[309];
bool cmp(student x,student y)
{
if(x.sum<y.sum) return 0;
if(x.sum==y.sum)
{
if(x.a<y.a) return 0;
if(x.a==y.a)
{
if(x.num>y.num) return 0;
}
}
return 1;
}
int main()
{
ios;
int n;
cin>>n;
for(int i = 1;i<=n;i++)
{
s[i].num = i;
cin>>s[i].a>>s[i].b>>s[i].c;
s[i].add();
}
sort(s+1,s+n+1,cmp);
for(int i = 1;i<=5;i++)
{
cout<<s[i].num<<' '<<s[i].sum<<"\n";
}
}
P1781
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
struct student
{
int num;
string a;
}s[29];
bool cmp(student x,student y)
{
if(x.a==y.a) return 1;
else if(x.a.length()!=y.a.length())
return x.a.length()>y.a.length();
else return x.a>y.a;
}
int main()
{
ios;
int n;
cin>>n;
for(int i = 1;i<=n;i++)
{
s[i].num = i;
cin>>s[i].a;
}
sort(s+1,s+n+1,cmp);
cout<<s[1].num<<"\n"<<s[1].a<<"\n";
}
P2676
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
int s[20009];
int main()
{
ios;
int n,B;
cin>>n>>B;
for(int i = 0;i<n;i++) cin>>s[i];
sort(s,s+n,greater<int>());
int sum = 0;
for(int i = 0;i<n;i++)
{
sum+=s[i];
if(sum>=B)
{
cout<<i+1<<"\n";
break;
}
}
}
P1116
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
int s[10009];
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++) cin>>s[i];
int ans = 0;
for(int i = 0;i<n;i++)
for(int j = i+1;j<n;j++)
{
if(s[i]>s[j])
{
swap(s[i],s[j]);
ans++;
}
}
cout<<ans<<"\n";
}
P1152
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
ll s[10009];
bool q[100000007];
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++) cin>>s[i];
bool flag = 1;
for(int i = 0;i<n-1;i++)
{
q[abs(s[i]-s[i+1])] = 1;
}
for(int i = 1;i<=n-1;i++)
{
if(!q[i]) flag = 0;
}
if(flag) cout<<"Jolly"<<"\n";
else cout<<"Not jolly"<<"\n";
}
P1068
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
struct person
{
int num;
int a;
}s[5009];
bool cmp(person x,person y)
{
if(x.a!=y.a)
return x.a>y.a;
else
return x.num<y.num;
}
int main()
{
int n,m;
cin>>n>>m;
m = m*1.5;
for(int i = 0;i<n;i++) cin>>s[i].num>>s[i].a;
sort(s,s+n,cmp);
int num = 0;
int mn = 0;
for(int i = 0;i<n;i++)
{
if(m)
{
if(i == 0||s[i].a!=s[i-1].a)
{
m--;
num++;
mn = s[i].a;
}
else if(s[i].a==s[i-1].a)
num++,m--;
}
else
{
if(s[i].a==s[i-1].a)
num++;
else
break;
}
}
cout<<mn<<' '<<num<<"\n";
for(int i = 0;i<num;i++)
cout<<s[i].num<<' '<<s[i].a<<"\n";
}
P5143
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
struct point
{
int x,y,z;
}s[50009];
bool cmp(point x,point y)
{
return x.z<y.z;
}
double d(int x,int y)
{
return sqrt((s[x].x-s[y].x)*(s[x].x-s[y].x)+
(s[x].y-s[y].y)*(s[x].y-s[y].y)+
(s[x].z-s[y].z)*(s[x].z-s[y].z));
}
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++) cin>>s[i].x>>s[i].y>>s[i].z;
sort(s,s+n,cmp);
double ans = 0;
for(int i = 0;i<n-1;i++)
{
ans+=d(i,i+1);
}
printf("%.3lf\n",ans);
}
P1104
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
struct student
{
string name;
int year,month,day;
int id;
}s[109];
bool cmp(student x,student y)
{
if(x.year<y.year)
return 1;
if(x.year==y.year)
{
if(x.month<y.month)
return 1;
if(x.month==y.month)
{
if(x.day<y.day)
return 1;
}
}
if(x.year==y.year&&x.month==y.month&&x.day==y.day)
return x.id>y.id;
return 0;
}
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++)
cin>>s[i].name>>s[i].year
>>s[i].month>>s[i].day,s[i],s[i].id = i;
sort(s,s+n,cmp);
for(int i = 0;i<n;i++) cout<<s[i].name<<"\n";
}
P1012
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include <iomanip>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
#define ios ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
const int N = 5e6+5;
string s[29];
bool cmp(string x,string y)
{
return x+y>y+x;
}
int main()
{
ios;
int n;
cin>>n;
for(int i = 0;i<n;i++) cin>>s[i];
sort(s,s+n,cmp);
for(int i = 0;i<n;i++)
cout<<s[i];
}